A curiosity regarding steganographic capacity of pathologically nonstationary sources

نویسنده

  • Andrew D. Ker
چکیده

Square root laws state that the capacity of an imperfect stegosystem – where the embedding does not preserve the cover distribution exactly – grows with the square root of cover size. Such laws have been demonstrated empirically and proved mathematically for a variety of situations, but not for nonstationary covers. Our aim here is to examine a highly simplified nonstationary source, which can have pathological and unpredictable behaviour. Intuition suggests that, when the cover source distribution is not perfectly known in advance, it should be impossible to distinguish covers and stego objects because the detector can never learn enough information about the varying cover source. However we show a strange phenomenon, whereby it is possible to distinguish stego and cover objects as long as the cover source is stationary for two pixels at a time, and then the capacity follows neither a square root law nor a linear law.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New results on steganographic capacity

This paper extends recent results on steganographic capacity. We derive capacity expressions for perfectly-secure steganographic systems. The warden may be passive, or active using a memoryless attack channel, or active using an arbitrarily varying channel. Neither encoder nor decoder know which channel was selected by the warden. In some cases, the steganographic constraint does not result in ...

متن کامل

Efficient Public Key Steganography Secure Against Adaptive Chosen Stegotext Attacks

We provide construction of steganographic schemes secure against adaptive chosen stegotext attacks. Our constructions achieve embedding rate equals to the Shannon entropy bound on steganographic channel capacity. Further the covertext distribution can be given as either an integrable probability function or as a random covertext sampler. We also introduce steganographic codes that are of intere...

متن کامل

F5—A Steganographic Algorithm High Capacity Despite Better Steganalysis

Many steganographic systems are weak against visual and statistical attacks. Systems without these weaknesses offer only a relatively small capacity for steganographic messages. The newly developed algorithm F5 withstands visual and statistical attacks, yet it still offers a large steganographic capacity. F5 implements matrix encoding to improve the efficiency of embedding. Thus it reduces the ...

متن کامل

Encryption based LSB Steganography Technique for Digital Images and Text Data

Digital steganography is the art and science of hiding communications; a steganographic system thus embeds secret data in public cover media so as not to arouse an eavesdropper’s suspicion. A steganographic system has two main aspects: steganographic capacity and imperceptibility. However, these two characteristics are at odds with each other. Furthermore, it is quite difficult to increase the ...

متن کامل

Capacity of the Additive Steganographic Channel Edics: 3-comm

Many digital steganographic systems employ the capacity of an additive white Gaussian noise (WGN) channel as a performance metric. We present results that show that this capacity metric understates the capacity potential of these systems and propose a more accurate measure based on the arbitrary noise channel. This measure is compared to the capacity of the additive WGN channel and the performa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011